Data transformations enabling loop vectorization on multithreaded data parallel architectures
نویسندگان
چکیده
منابع مشابه
Semi-automatic Composition of Data Layout Transformations for Loop Vectorization
In this paper we put forward an annotation system for specifying a sequence of data layout transformations for loop vectorization. We propose four basic primitives for data layout transformations that programmers can compose to achieve complex data layout transformations. Our system automatically modifies all loops and other code operating on the transformed arrays. In addition, we propose data...
متن کاملLoop and Data Transformations : A
In this tutorial, we address the problem of restructuring a (possibly sequential) program to improve execution eeciency on parallel machines. This restructuring involves the transformation and partitioning of loop structures and data so as to improve parallelism, static and dynamic locality, and load balance. We present previous and ongoing work on loop and data transformations and motivate a u...
متن کاملParallel Multithreaded Processing for Data Set Summarization on Multicore CPUs
Data mining algorithms should exploit new hardware technologies to accelerate computations. Such goal is difficult to achieve in database management system (DBMS) due to its complex internal subsystems and because data mining numeric computations of large data sets are difficult to optimize. This paper explores taking advantage of existing multithreaded capabilities of multicore CPUs as well as...
متن کاملLoop and Data Transformations: A Tutorial
In this tutorial, we address the problem of restructuring a (possibly sequential) program to improve execution eeciency on parallel machines. This restructuring involves the transformation and partitioning of loop structures and data so as to improve parallelism, static and dynamic locality, and load balance. We present previous and ongoing work on loop and data transformations and motivate a u...
متن کاملMinimal Data Dependence Abstractions for Loop Transformations
Many abstractions of program dependences have already been proposed such as the Dependence Distance the Dependence Di rection Vector the Dependence Level or the Dependence Cone These di erent abstractions have di erent precision The min imal abstraction associated to a transformation is the abstrac tion that contains the minimal amount of information necessary to decide when such a transformati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2010
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1837853.1693510